Generalized DNA matrices, Silver Means, and Pythagorean Triples

نویسندگان

  • Jay Kappraff
  • Gary W. Adamson
چکیده

Petoukhov [1], [2], [3] has studied a family of bisymmetric 2 n x 2 n matrices that code the structure of the four DNA bases, the 64 codons that make up the 20 amino acids in all living structures, and beyond that, the proteins assembled from the amino acids as building blocks [1], [2], [3]. As the result of his studies he has found that the amino acids express certain degeneracies, 8 with high degeneracy containing 4 or more codons, and 12 with low degeneracy, containing less than 4 codons. He suggests that these values may be the result of 24 hour chronocycles. These degeneracies are propagated through 17 different classes of DNA. Although different groups of codons correspond to the same amino acid in different DNA types, the quality of the degeneracy (high or low) is preserved. The first matrix of the family expresses the fact that two of the DNA bases have 3 hydrogen bonds while the other two have 2 hydrogen bonds. The rows and columns of his family of matrices reproduce the sequences of musical fifths, i.e., integer ratios of 3:2, found in a table attributed to the Roman mathematician of the first century AD, Nicomachus [4]. The integer values in this table have multiplicities given by the columns of Pascal’s triangle. The square roots of this family of matrices have entries that are all powers of the golden mean.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetries, Generalized Numbers and Harmonic Laws

This paper is devoted to the presentation and analysis of matrix representations of the genetic code. Principal attention is paid to a family of the genetic matrices which are constructed on the basis of Gray code ordering of their rows and columns. This Gray code ordering reveals new connections of the genetic code to: 8dimensional bipolar algebras; Hadamard matrices; golden matrices; Pythagor...

متن کامل

The Modular Tree of Pythagorus

The Pythagorean triples of integers satisfying x + y = z have been studied and enumerated since Babylonian times. Since Diophantus, it has been known that this set of triples is related to the standard rational parameterization of the unit circle, ( t 2−1 t2+1 , 2t t2+1 ). The Pythagorean triple solutions, which are relatively prime, have the elementary and beautiful characterization as integer...

متن کامل

The Modular Tree of Pythagoras

The Pythagorean triples that are relatively prime (called the primitive triples) have the elementary and beautiful characterization as integers x = m2 − n2, y = 2mn, z = m2 + n2 (when y is even) for relatively prime integers m and n of opposite parity. One can think of this as replacing the parameter t for the circle with the fraction m/n and then scaling. Our motivation for understanding the t...

متن کامل

The Pythagorean Tree: A New Species

In 1963, the Dutch mathemetician F.J.M. Barning described an infinite, planar, ternary tree whose nodes are just the set of Primitive Pythagorean triples. Seven years later, A. Hall independently discovered the same tree. Both used the method of uni-modular matrices to transform one triple to another. A number of rediscoveries have occurred more recently. The purpose of this article is to annou...

متن کامل

Parametrization of Pythagorean triples by a single triple of polynomials

It is well known that Pythagorean triples can be parametrized by two triples of polynomials with integer coefficients. We show that no single triple of polynomials with integer coefficients in any number of variables is sufficient, but that there exists a parametrization of Pythagorean triples by a single triple of integer-valued polynomials. The second author has recently studied polynomial pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006